Lattice gas with nearest- and next-to-nearest-neighbor exclusion
نویسندگان
چکیده
منابع مشابه
First- and second-order phase transitions in a driven lattice gas with nearest-neighbor exclusion.
A lattice gas with infinite repulsion between particles separated by < or = 1 lattice spacing, and nearest-neighbor hopping dynamics, is subject to a drive favoring movement along one axis of the square lattice. The equilibrium (zero drive) transition to a phase with sublattice ordering, known to be continuous, shifts to lower density, and becomes discontinuous for large bias. In the ordered no...
متن کاملFirst-order phase transition in a driven lattice gas with nearest-neighbor exclusion
A lattice gas with infinite repulsion between particles separated by ≤ 1 lattice spacing, and nearest-neighbor hopping dynamics, is subjected to a drive that favors movement along the +x direction. The equilibrium (zero drive) transition to a phase with sublattice ordering, known to be continuous, turns discontinuous, and shifts to lower density with increasing bias. In the ordered nonequilibri...
متن کاملGround states of the lattice-gas model on the triangular lattice with nearest- and next-nearest-neighbor pairwise interactions and with three-particle interaction: full-dimensional ground states.
In this paper, we completely solve the problem of the ground states of the lattice-gas model on the infinite plane triangular lattice with nearest- and next-nearest-neighbor pairwise interactions and with additional interaction between three particles at the vertices of a nearest-neighbor triangle. We use this model to illustrate how the complete solution of the ground-state problem of a lattic...
متن کاملSpin chain under next nearest neighbor interaction
We perform a numerical study on the concurrence of the ground state Heisenberg XXX with next-nearest-neighbor interaction with open and periodic boundary condition.
متن کاملFast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph
We introduce a new nearest neighbor search algorithm. The algorithm builds a nearest neighbor graph in an offline phase and when queried with a new point, performs hill-climbing starting from a randomly sampled node of the graph. We provide theoretical guarantees for the accuracy and the computational complexity and empirically show the effectiveness of this algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2011
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.83.061153